#include <bits/stdc++.h>
using namespace std;

int n,a[100005];
bool used[100005];
void solve(){
    cin>>n;
    for(int i=0;i<n;i++)cin>>a[i];
    sort(a,a+n);
    int pmx=0,ded=0;
    for(int i=0;i<n;i++){
        while(a[pmx]==a[i]||used[pmx])pmx++;
//        cout<<a[i]<<"#"<<pmx<<endl;
        if(pmx==n)break;
        used[pmx]=1;
        ded++;
    }
    cout<<n-ded<<endl;
}
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    solve();
    return 0;
}